Meeting strength in substructural logics

نویسنده

  • Yde Venema
چکیده

This paper contributes to the theory of hybrid substructural logics, i.e. weak logics given by a Gentzen-style proof theory in which there is only a limited possibility to use structural rules. Following the literature, we use an operator to mark formulas to which the extra structural rules may be applied. New in our approach is that we do not see this ∇ as a modality, but rather as the meet of the marked formula with a special type Q. In this way we can make the specific structural behaviour of marked formulas more explicit. The main motivation for our approach is that we can provide a nice, intuitive semantics for hybrid substructural logics. Soundness and completeness for this semantics are proved; besides this we consider some proof-theoretical aspects like cut-elimination and embeddings of the ‘strong’ system in the hybrid one. ∗Faculteit Wiskunde en Informatica, Vrije Universiteit, Amsterdam & Centrum voor Wiskunde en Informatica, P.O. Box 4079, 1009 GB Amsterdam; e-mail: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Substructural Logics and Residuated Lattices — an Introduction

This is an introductory survey of substructural logics and of residuated lattices which are algebraic structures for substructural logics. Our survey starts from sequent systems for basic substructural logics and develops the proof theory of them. Then, residuated lattices are introduced as algebraic structures for substructural logics, and some recent developments of their algebraic study are ...

متن کامل

A Canonical Model Construction for Substructural Logics

In this paper, we introduce a class of substructural logics, called normal substructural logics, which includes not only relevant logic, BCK logic, linear logic and the Lambek calculus but also weak logics with strict implication, and de ne Kripkestyle semantics (Kripke frames and models) for normal substructural logics. Then we show a correspondence between axioms and properties on frames, and...

متن کامل

Models for Substructural Arithmetics

This paper explores models for arithmetics in substructural logics. In the existing literature on substructural arithmetic, frame semantics for substructural logics are absent. We will start to fill in the picture in this paper by examining frame semantics for the substructural logics C (linear logic plus distribution), R (relevant logic) and CK (C plus weakening). The eventual goal is to find ...

متن کامل

Modalities in Substructural Logics

This paper generalises Girard's results which embed intuitionistic logic into linear logic by showing how arbitrary substructural logics can be embedded into weaker substructural logics, using a single modality whichèncodes' the new structural rules. Logics 1 1. Logics Logic is about valid deduction. One central result in logic is the deduction theorem. A; ` B if and only if`A ! B This result t...

متن کامل

Practical Programming with Substructural Types

Substructural logics remove from classical logic rules for reordering, duplication, or dropping of assumptions. Because propositions in such a logic may no longer be freely copied or ignored, this suggests understanding propositions in substructural logics as representing resources rather than truth. For the programming language designer, substructural logics thus provide a framework for consid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Studia Logica

دوره 54  شماره 

صفحات  -

تاریخ انتشار 1995